Addressing the Facilities Layout Design Problem through Constraint Logic Programming
نویسندگان
چکیده
One of the most difficult problems that face researchers experimenting with complex systems in real world applications is the Facility Layout Design Problem. It relies with the design and location of production lines, machinery and equipment, inventory storage and shipping facilities. In this work it is intended to address this problem through the use of Constraint Logic Programming (CLP) technology. The use of Genetic Algorithms (GA) as optimisation technique in CLP environment is also an issue addressed. The approach aims the implementation of genetic algorithm operators following the CLP paradigm.
منابع مشابه
Constraint Programming and Genetic Algorithms to Solve Layout Design Problem
Real world optimization problems are typically complex and difficult to solve. In this work it is intended to address these problems through a combination of two techniques: Constraint Logic Programming (CLP) and Genetic Algorithms (GA). This approach aims to benefit, on the one hand, from the easiness and naturalness of the CLP to express problems whose formulation is based on constraints, and...
متن کاملIntegrative Cell Formation and Layout Design in Cellular Manufacturing Systems
This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...
متن کاملMathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملA Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
متن کاملA Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کامل